Communication Complexity And Linearly Ordered Sets
نویسندگان
چکیده
منابع مشابه
Automorphisms of Powers of Linearly Ordered Sets
Let I = ([0; 1];_;^; 0; 1), where _ and ^ are max and min, respectively. This algebra is the basic building block of fuzzy set theory and logic. Likewise, the algebra I = ([0; 1];_;^; 0; 1), where [0; 1] = f(a; b) : a; b 2 [0; 1], a bg, _, ^ are given coordinate-wise, and 0 and 1 are the bounds on [0; 1], is the relevant algebra for interval-valued fuzzy set theory and logic. A good share of th...
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملPattern classes of permutations via bijections between linearly ordered sets
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation ...
متن کاملOrdered Biclique Partitions and Communication Complexity Problems
An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...
متن کاملThe complexity space of a valued linearly ordered set
By a valued linearly ordered set (a VLOS for short), we mean a pair (X,φ) such that X is a linearly ordered set and φ is a strictly increasing (= positive monotone) nonnegative real valued function. Clearly, any VLOS is a valuation space. Each VLOS (X,φ) generates a linear weightable quasi-metric dφ on X whose conjugate is order preserving. We show that the Smyth completion of (X, dφ) also admi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Mathematicae Silesianae
سال: 2015
ISSN: 0860-2107
DOI: 10.1515/amsil-2015-0008